On k-edge-magic labelings of maximal outerplanar graphs

On Edge-Graceful and Edge-Magic Maximal Outerplanar Graphs

Let G be a (p,q)-graph in which the edges are labeled 1,2,3,...q. The vertex sum for a vertex v is the sum of the labels of the incident edges at v. If G can be labeled so that the vertex sums are distinct, mod p, then G is said to be edgegraceful. If the edges of G can be labeled 1,2,3,...q so that the vertex sums are constant, mod p, then G is said to be edgemagic. It is conjectured by Lee [9...

On edge-magic labelings of certain disjoint unions of graphs

Edge-magic total labelings

Various graph labelings that generalize the idea of a magic square have been discussed. In particular a magic labeling on a graph with v vertices and e edges will be defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, ... , v+e with the property that the sum of the label on an edge and the labels of its endpoints is constant independent of the choice of edge. Prope...

Totally magic labelings of graphs

Distance magic labelings of graphs

As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . . . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = ...